Distributed Strategies for Group-Balancing General Weighted Directed/Undirected Graphs
نویسندگان
چکیده
منابع مشابه
Weighted Matchings in General Graphs
In the previous section we saw how we could use LP duality theory to develop an algorithm for the weighted matching problem in bipartite graphs. In this section, we’ll see how to extend that algorithm to handle general graphs. As in the unweighted case, blossom-shrinking plays a central role. However, in weighted graphs we will handle blossoms a bit differently. In particular, we will maintain ...
متن کاملCorrelation clustering in general weighted graphs
We consider the following general correlation-clustering problem [1]: given a graph with real nonnegative edge weights and a 〈+〉/〈−〉 edge labeling, partition the vertices into clusters to minimize the total weight of cut 〈+〉 edges and uncut 〈−〉 edges. Thus, 〈+〉 edges with large weights (representing strong correlations between endpoints) encourage those endpoints to belong to a common cluster w...
متن کاملA Review of Load Balancing Strategies for Distributed Systems
The main concern of DCS is reliability. For improving the reliability one way is proper task allocation among the nodes and load balancing is one of the best ways to improve not only reliability but throughput and minimizes execution time. In this paper, we reviewed the concept of load balancing and various mechanisms and finally compared static and dynamic load balancing. The main purpose of t...
متن کاملPerformance Comparison of Dynamic Load-Balancing Strategies for Distributed Computing
The DASUD (Diffusion Algorithm Searching Unbalanced Domains) algorithm belongs to the nearestneighbours class and operates in a diffusion scheme where a processor balances its load with all its neighbours. DASUD detects unbalanced domains and performs local exchange of load between processors to achieve global balancing. The DASUD algorithm has been evaluated by comparison with another well-kno...
متن کاملGroup Weighted Matchings in Bipartite Graphs
Let G be a bipartite graph with bicoloration {A, B}, |A| = |B|, and let w : E(G) -» K where K is a finite abelian group with k elements. For a subset S c E(G) let w(S) = IIeE s (e).A Perfect matching M c E(G) is a w-matching if w(M) = 1. A characterization is given for all w's for which every perfect matching is a w-matching. It is shown that if G = Kk+1,k+1 then either G has no w-matchings or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2016
ISSN: 2324-7991,2324-8009
DOI: 10.12677/aam.2016.53058